David Tree

Results: 339



#Item
91Search algorithms / Discrete geometry / Data mining / Information retrieval / Nearest neighbor search / K-d tree / K-nearest neighbor algorithm / Point location / Voronoi diagram / Information science / Mathematics / Geometry

An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions Sunil Arya Hong Kong University of Science and Technology, Hong Kong, David M. Mount University of Maryland, College Park, Maryland,

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2006-04-04 05:02:45
92Discrete geometry / Computational geometry / Diagrams / Voronoi diagram / K-d tree / Nearest neighbor search / Quadtree / Information science / Mathematics / Geometry

Space-Efficient Approximate Voronoi Diagrams Sunil Arya Theocharis Malamatos∗ David M. Mount†

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2006-04-04 10:51:46
93Search algorithms / Discrete geometry / Computational geometry / Data mining / Information retrieval / Nearest neighbor search / Proximity problems / K-d tree / Voronoi diagram / Mathematics / Information science / Geometry

Approximate Nearest Neighbor Queries in Fixed Dimensions∗ Sunil Arya† David M. Mount‡ S and computing the distance to q. More efficient approaches are based on preprocessing the points S and creating a data structu

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2006-04-04 10:49:25
94Statistical theory / Information theory / Point location / Entropy / K-d tree / Decision tree model / FO / Bin / Logarithm / Theoretical computer science / Mathematics / Applied mathematics

Efficient Expected-Case Algorithms for Planar Point Location Sunil Arya1 , Siu-Wing Cheng⋆1 , David M. Mount⋆⋆2 , and H. Ramesh3 1 Department of Computer Science, The Hong Kong University of Science and

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2006-04-04 10:58:25
95C++ / Data types / Primitive types / C programming language / Procedural programming languages / Pointer / Tree traversal / Reference / C / Software engineering / Computing / Computer programming

Lightweight Annotations for Controlling Sharing in Concurrent Data Structures Zachary Anderson David Gay

Add to Reading List

Source URL: www.barnowl.org

Language: English - Date: 2009-04-01 19:08:58
96K-d tree / Quadtree / R-tree / Bin / Search algorithms / Discrete geometry / Computing / Data management / Computer programming

Approximate Range Searching∗ Sunil Arya† Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong David M. Mount‡

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2006-04-04 10:41:36
97Information retrieval / Numerical analysis / Discrete geometry / Machine learning / Nearest neighbor search / K-d tree / K-nearest neighbor algorithm / Information science / Mathematics / Search algorithms

Accounting for Boundary Effects in Nearest Neighbor Searching∗ Sunil Arya† David M. Mount‡

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2006-04-04 05:14:01
98Information science / Topology / Doubling measure / Metric space / Ball / Nearest neighbor search / B-tree / Geometry / Mathematics / Metric geometry

Space-Time Tradeoffs for Proximity Searching in Doubling Spaces Sunil Arya⋆1 , David M. Mount⋆⋆2 , Antoine Vigneron⋆ ⋆ ⋆3 , and Jian Xia†1 1 2

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2010-08-18 05:43:59
99Computing / Nearest neighbor search / K-d tree / K-nearest neighbor algorithm / Tree / B-tree / Binary search tree / R-tree / Proximity problems / Information science / Mathematics / Search algorithms

Algorithms for Fast Vector Quantization∗ Sunil Arya† Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong David M. Mount‡

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2006-04-04 04:49:15
100NP-complete problems / Graph operations / Dominating set / Neighbourhood / Tree decomposition / Tree / Planar graph / Graph / Degree / Graph theory / Mathematics / Theoretical computer science

Approximating k-center in planar graphs David Eisenstat∗ Philip N. Klein∗ Abstract

Add to Reading List

Source URL: www.di.ens.fr

Language: English - Date: 2013-10-10 10:36:31
UPDATE